Are Lock-Free Concurrent Algorithms Practically Wait-Free?

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Are lock-free concurrent algorithms practically wait-free? Citation

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...

متن کامل

Obstruction-Free Algorithms Can Be Practically Wait-Free

The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations that are faster in the uncontended case. Pragmatic contention management techniques appear to be effective at facilitating progress in practice, but, as far as we know, none guarantees progress. We present a transformation that ...

متن کامل

Randomized Wait Free Concurrent Objects

A concurrent object is a data structure shared by concurrent processes A wait free implementation of a concurrent object guarantees that every operation completes in a nite number of steps regardless of how processes interleave It is known however that if concurrent processes communicate only by applying read and write operations to a shared memory then it is impossible to con struct wait free ...

متن کامل

Lock-free Concurrent Data Structures

Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respe...

متن کامل

Wait-Free Algorithms for Heaps

This paper examines algorithms to implement heaps on shared memory multiprocessors. A natural model for these machines is an asynchronous parallel machine, in which the processors are subject to arbitrary delays. On such machines, it is desirable for algorithms to be wait-free, meaning that each thread makes progress independent of the other threads executing on the machine. We present a waitfr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the ACM

سال: 2016

ISSN: 0004-5411,1557-735X

DOI: 10.1145/2903136